On the Excedance Sets of Colored Permutations

نویسنده

  • ROBERT SHWARTZ
چکیده

We define the excedence set and the excedance word on Gr,n, generalizing a work of Ehrenborg and Steingrimsson and use the inclusion-exclusion principle to calculate the number of colored permutations having a prescribed excedance word. We show some symmetric properties as Log concavity and unimodality of a specific sequence of excedance words.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recursions for Excedance Number in Some Permutations Groups

The excedance number for Sn is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored permutation groups Gr,n. The generalized recursion yields some interesting connection to Stirling numbers of the second kind. We also show some logconcavity resul...

متن کامل

Recursions for Excedance Number in Some Permutations Groups

We present recursions for the number of excedances in Coxeter groups of type A and B, as well as in the colored permutation groups Zr ≀ Sn. The proofs use only computations of excedances.

متن کامل

Efficient generating algorithm for permutations with a fixed number of excedances

In this paper, we develop a constant amortized time (CAT) algorithm for generating permutations with a fixed number of excedances. We obtain a Gray code for permutations having one excedance. We also give a bijection between the set of n-length permutations with exactly one excedance and the set Sn(321, 2413, 3412, 21534)\{123 . . . (n− 1)n}. This induces a Gray code for the set Sn(321, 2413, 3...

متن کامل

On the Excedance Number of Colored Permutation Groups

We generalize the results of Ksavrelof and Zeng about the multidistribution of the excedance number of Sn with some natural parameters to the colored permutation group and to the Coxeter group of type D. We define two different orders on these groups which induce two different excedance numbers. Surprisingly, in the case of the colored permutation group, we get the same generalized formulas for...

متن کامل

Excedances in classical and affine Weyl groups

Based on the notion of colored and absolute excedances introduced by Bagno and Garber we give an analogue of the derangement polynomials. We obtain some basic properties of these polynomials. Moreover, we define an excedance statistic for the affine Weyl groups of type B̃n, C̃n and D̃n and determine the generating functions of their distributions. This paper is inspired by one of Clark and Ehrenbo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008